Conflict-Free Coloring Made Stronger

In FOCS 2002, Even et al. showed that any set of $n$ discs in the plane can be Conflict-Free colored with a total of at most $O(\log n)$ colors. That is, it can be colored with $O(\log n)$ colors such that for any (covered) point $p$ there is some disc whose color is distinct from all other colors of discs containing $p$. They also showed that this bound is asymptotically tight. In this paper we prove the following stronger results: \begin{enumerate} \item [(i)] Any set of $n$ discs in the plane can be colored with a total of at most $O(k \log n)$ colors such that (a) for any point $p$ that is covered by at least $k$ discs, there are at least $k$ distinct discs each of which is colored by a color distinct from all other discs containing $p$ and (b) for any point $p$ covered by at most $k$ discs, all discs covering $p$ are colored distinctively. We call such a coloring a {\em $k$-Strong Conflict-Free} coloring. We extend this result to pseudo-discs and arbitrary regions with linear union-complexity. \item [(ii)] More generally, for families of $n$ simple closed Jordan regions with union-complexity bounded by $O(n^{1+\alpha})$, we prove that there exists a $k$-Strong Conflict-Free coloring with at most $O(k n^\alpha)$ colors. \item [(iii)] We prove that any set of $n$ axis-parallel rectangles can be $k$-Strong Conflict-Free colored with at most $O(k \log^2 n)$ colors. \item [(iv)] We provide a general framework for $k$-Strong Conflict-Free coloring arbitrary hypergraphs. This framework relates the notion of $k$-Strong Conflict-Free coloring and the recently studied notion of $k$-colorful coloring. \end{enumerate} All of our proofs are constructive. That is, there exist polynomial time algorithms for computing such colorings

Dynamic Windows Scheduling with Reallocation

We consider the Windows Scheduling problem. The problem is a restricted version of Unit-Fractions Bin Packing, and it is also called Inventory Replenishment in the context of Supply Chain. In brief, the problem is to schedule the use of communication channels to clients. Each client ci is characterized by an active cycle and a window wi. During the period of time that any given client ci is active, there must be at least one transmission from ci scheduled in any wi consecutive time slots, but at most one transmission can be carried out in each channel per time slot. The goal is to minimize the number of channels used. We extend previous online models, where decisions are permanent, assuming that clients may be reallocated at some cost. We assume that such cost is a constant amount paid per reallocation. That is, we aim to minimize also the number of reallocations. We present three online reallocation algorithms for Windows Scheduling. We evaluate experimentally these protocols showing that, in practice, all three achieve constant amortized reallocations with close to optimal channel usage. Our simulations also expose interesting trade-offs between reallocations and channel usage. We introduce a new objective function for WS with reallocations, that can be also applied to models where reallocations are not possible. We analyze this metric for one of the algorithms which, to the best of our knowledge, is the first online WS protocol with theoretical guarantees that applies to scenarios where clients may leave and the analysis is against current load rather than peak load. Using previous results, we also observe bounds on channel usage for one of the algorithms.Comment: 6 figure

Variable frequency picosecond optical pulse generation from laser diodes by electrical feedback

High repetition rate picosecond optical pulse generation is achieved by providing electrical feedback (with and without external gain) to a self-pulsating laser diode. The feedback improves pulsation short-term stability (<25-kHz frequency jitter) and narrows the laser pulses (14 ps)

Vertical field-effect transistors in III-V semiconductors

Vertical metal-semiconductor field-effect transistors in GaAs/GaAlAs and vertical metal-oxide-semiconductor field-effect transistors (MOSFET's) in InP/GaInPAs materials have been fabricated. These structures make possible short channel devices with gate lengths defined by epitaxy rather than by submicron photolithography processes. Devices with transconductances as high as 280 mS/mm in GaAs and 60 mS/mm (with 100-nm gate oxide) for the InP/GaInPAs MOSFET's were observed

Phased arrays of buried-ridge InP/InGaAsP diode lasers

Phase-locked arrays of buried-ridge InP/InGaAsP lasers, emitting at 1.3 µm, were grown by liquid phase epitaxy. The arrays consist of index-guided, buried-ridge lasers which are coupled via their evanescent optical fields. This index-guided structure makes it possible to avoid the occurrence of lower gain in the interchannel regions. As a result, the buried-ridge arrays oscillate mainly in the fundamental supermode, which yields single lobed, narrow far-field patterns. Single lobed beams less than 4° in width were obtained from buried-ridge InP/InGaAsP phased arrays up to more than twice the threshold current

Phase-locking characteristics of coupled ridge-waveguide InP/InGaAsP diode lasers

The phase-locking characteristics of two coupled, ridge waveguide InP/InGaAsP diode lasers emitting at 1.2 µm were investigated experimentally. The phase locking of the lasers was verified by the observation of phase-locked modes (supermodes) in the spectrally resolved near fields and distinct diffraction patterns in the far field. By independent control of the laser currents it was possible to vary continuously the mutual phase shift between the two phase-locked lasers and thus steer the far-field diffraction lobes. In addition, the separate current control could be utilized to obtain single longitudinal mode oscillation of the phase-locked lasers. Variation in one of the laser currents resulted then in tuning of the wavelength of this single mode over a range of 90 Å

Discovering Beaten Paths in Collaborative Ontology-Engineering Projects using Markov Chains

Biomedical taxonomies, thesauri and ontologies in the form of the International Classification of Diseases (ICD) as a taxonomy or the National Cancer Institute Thesaurus as an OWL-based ontology, play a critical role in acquiring, representing and processing information about human health. With increasing adoption and relevance, biomedical ontologies have also significantly increased in size. For example, the 11th revision of the ICD, which is currently under active development by the WHO contains nearly 50,000 classes representing a vast variety of different diseases and causes of death. This evolution in terms of size was accompanied by an evolution in the way ontologies are engineered. Because no single individual has the expertise to develop such large-scale ontologies, ontology-engineering projects have evolved from small-scale efforts involving just a few domain experts to large-scale projects that require effective collaboration between dozens or even hundreds of experts, practitioners and other stakeholders. Understanding how these stakeholders collaborate will enable us to improve editing environments that support such collaborations. We uncover how large ontology-engineering projects, such as the ICD in its 11th revision, unfold by analyzing usage logs of five different biomedical ontology-engineering projects of varying sizes and scopes using Markov chains. We discover intriguing interaction patterns (e.g., which properties users subsequently change) that suggest that large collaborative ontology-engineering projects are governed by a few general principles that determine and drive development. From our analysis, we identify commonalities and differences between different projects that have implications for project managers, ontology editors, developers and contributors working on collaborative ontology-engineering projects and tools in the biomedical domain.Comment: Published in the Journal of Biomedical Informatic

Cd diffused mesa-substrate buried heterostructure InGaAsP/InP laser

A new type of buried heterostructure InGaAsP/InP lasers grown by a single-step liquid phase epitaxy on Cd diffused mesa substrate is described. These lasers exhibit excellent current and optical confinement. Threshold currents as low as 15 mA are achieved for a laser with a 2-µm-wide active region

Short cavity InGaAsP/InP lasers with dielectric mirrors

Short cavity length (38 µm) lasers have been fabricated using a recently developed microcleavage technique. SiO2-amorphous Si multilayer coatings have been evaported on the lasers to obtain high reflectivity mirrors. The lasers have current thresholds as low as 3.8 mA with 85% reflecting front mirror and high reflectivity rear mirror and 2.9 mA with two high reflectivity mirrors. Single longitudinal mode operation is observed over a wide range of driving currents and temperatures